Properties of Fixed Points in Axiomatic Domain Theory
نویسنده
چکیده
Fixed points play a central role in domain theory, where, traditionally, the least-xed-point operator for continuous endofunctions on complete partial orders (cpos) is used. Recently, there has been considerable interest in developing a more general axiomatic (and order-free) account of the constructions of domain theory. Peter Freyd made an essential contribution to this programme by emphasising a novel universal property for the xed-points (up to isomorphism) of functors 5, 6]. When an appropriate functor has such a xed-point, it follows that there exists a xed-point operator acting on endomorphisms 5, 2]. Moreover, the xed-point operator is characterised by the property of uniformity, stated with respect to a subcategory of strict maps 9, 5]. We investigate the equational properties that hold between xed-point terms (terms) in such an axiomatic setting. Freyd already showed in 5] that a number of basic equational properties (such as dinaturality) hold. Here we provide a complete characterisation of all the valid equations. We work in a general categorical setting based on the authors' previous work on axiomatic domain theory 10, 4]. We show that, under mild conditions, the induced xed-point operator endows the appropriate category with a unique well-behaved parameterized xed-point operator (Theorem 3). By a general completeness result (Theorem 2), it follows that the axioms of iteration theories 1] are complete for deriving all valid xed-point equations. The general completeness result follows from an, apparently new, syntactic characterisation of the iteration theory equations as inducing a maximally consistent typically ambiguous theory (Theorem 1).
منابع مشابه
Complete Axioms for Categorical Fixed-Point Operators
We give an axiomatic treatment of fixed-point operators in categories. A notion of iteration operator is defined, embodying the equational properties of iteration theories. We prove a general completeness theorem for iteration operators, relying on a new, purely syntactic characterisation of the free iteration theory. We then show how iteration operators arise in axiomatic domain theory. One re...
متن کاملAxiomatic Domain Theory
The denotational semantics approach to the semantics of programming languages interprets the language constructions by assigning elements of mathematical structures to them. The structures form so-called categories of domains and the study of their closure properties is the subject of domain theory Sco70, Sco82, Plo83, GS90, AJ94]. Typically, categories of domains consist of suitably complete p...
متن کاملFoundations of Mathematics Vol . 1 ( 1934 )
2. Elementary number theory.—Finite inferring and its limits. The question raised at the end of the previous paragraph, whether we couldn’t found arithmetic directly by a method independent of axiomatics and make a special proof of consistency superfluous, gives us reason to recall that the method of rigorous axiomatics, especially existential inference, presupposing a fixed domain of individua...
متن کاملAlternative Axiomatic Characterizations of the Grey Shapley Value
The Shapley value, one of the most common solution concepts of cooperative game theory is defined and axiomatically characterized in different game-theoretic models. Certainly, the Shapley value can be used in interesting sharing cost/reward problems in the Operations Research area such as connection, routing, scheduling, production and inventory situations. In this paper, we focus on the Shapl...
متن کاملOn some fixed points properties and convergence theorems for a Banach operator in hyperbolic spaces
In this paper, we prove some fixed points properties and demiclosedness principle for a Banach operator in uniformly convex hyperbolic spaces. We further propose an iterative scheme for approximating a fixed point of a Banach operator and establish some strong and $Delta$-convergence theorems for such operator in the frame work of uniformly convex hyperbolic spaces. The results obtained in this...
متن کامل